Partitioning and ranking tagged data sources
نویسندگان
چکیده
منابع مشابه
Partitioning and Ranking Tagged Data Sources
Online types of expression in the form of social networks, micro-blogging, blogs and rich content sharing platforms have proliferated in the last few years. Such proliferation contributed to the vast explosion in online data sharing we are experiencing today. One unique aspect of online data sharing is tags manually inserted by content generators to facilitate content description and discovery ...
متن کاملComputational Drug Repositioning by Ranking and Integrating Multiple Data Sources
Drug repositioning helps identify new indications for marketed drugs and clinical candidates. In this study, we proposed an integrative computational framework to predict novel drug indications for both approved drugs and clinical molecules by integrating chemical, biological and phenotypic data sources. We defined different similarity measures for each of these data sources and utilized a weig...
متن کاملRanking Tagged Resources Using Social Semantic Relevance
The WWW today is overwhelmed with information on almost every topic. Therefore, relevance ranking of web pages to a user’s expectations is a challenge, rather than retrieving a collection of thousands of web pages selected by keyword matching. This paper presents an approach to rank tagged web pages retrieved from a Social Bookmarking Site for a learner who needs web resources containing conten...
متن کاملLabel Partitioning For Sublinear Ranking
We consider the case of ranking a very large set of labels, items, or documents, which is common to information retrieval, recommendation, and large-scale annotation tasks. We present a general approach for converting an algorithm which has linear time in the size of the set to a sublinear one via label partitioning. Our method consists of learning an input partition and a label assignment to e...
متن کاملOn Partitioning Rules for Bipartite Ranking
The purpose of this paper is to investigate the properties of partitioning scoring rules in the bipartite ranking setup. We focus on ranking rules based on scoring functions. General sufficient conditions for the AUC consistency of scoring functions that are constant on cells of a partition of the feature space are provided. Rate bounds are obtained for cubic histogram scoring rules under mild ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2013
ISSN: 2150-8097
DOI: 10.14778/2535570.2488330